#include "Priority_queue.h"

using namespace std;

int main()
{
	bit::priority_queue<int, vector<int>, greater<int>> q;

	q.push(5);
	q.push(4);
	q.push(2);
	q.push(3);
	q.push(12);

	while (q.size())
	{
		auto t = q.top();
		cout << t << " ";
		q.pop();
	}
	return 0;
}